Combinatorial distance between HNN decompositions of a group

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A distance measure between labeled combinatorial maps

Combinatorial maps are widely used in image representation and processing, however map matching problems have not been extensively researched. This paper addresses the problem of inexact matching between labeled combinatorial maps. First, the concept of edit distance is extended to combinatorial maps, and then used to define mapping between combinatorial maps as a sequence of edit operations th...

متن کامل

An Ascending Hnn Extension of a Free Group Inside

We give an example of a subgroup of SL2 C which is a strictly ascending HNN extension of a non-abelian finitely generated free group F . In particular, we exhibit a free group F in SL2 C of rank 6 which is conjugate to a proper subgroup of itself. This answers positively a question of Drutu and Sapir (2005). The main ingredient in our construction is a specific finite volume (non-compact) hyper...

متن کامل

A duality between pairs of split decompositions for a Q-polynomial distance-regular graph

Let Γ denote a Q-polynomial distance-regular graph with diameter D ≥ 3 and standard module V . Recently Ito and Terwilliger introduced four direct sum decompositions of V ; we call these the (μ, ν)–split decompositions of V , where μ, ν ∈ {↓, ↑}. In this paper we show that the (↓, ↓)–split decomposition and the (↑, ↑)–split decomposition are dual with respect to the standard Hermitian form on V...

متن کامل

On the Minimal Distance between Group Tables

We examine the minimal distance (number of differing entries) between different group tables of the same order n. Here group table means a matrix of order n with entries from a fixed set of n symbols, which (with suitable border elements) is the multiplication table of a group. (The border elements are not considered part of the table. A group is defined up to isomorphism by its multiplication ...

متن کامل

Group-to-Group Distance Collaboration: Examining the "Space Between"

Organizations are moving towards a new type of work: group-to-group collaboration across distance, supported by technologies that connect rooms across distance into large collaboration spaces. In this study we report on distributed group-to-group collaboration in the domain of space mission design. We use the metaphor of the “space between” distant groups to describe the connections, interdepen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 1992

ISSN: 0022-4049

DOI: 10.1016/0022-4049(92)90172-c